Stanley's conjectures on the Stern poset
نویسندگان
چکیده
The Stern poset S is a graded infinite naturally associated with Stern's triangle, which was defined by Stanley, in analogy Pascal's triangle. Stanley noted that every interval distributive lattice. Let Pn denote the unique (up to isomorphism) for set of its order ideals, ordered inclusion, isomorphic from element row 0 triangle n-th r sufficiently large r. For n?1 letLn(q)=2?(?k=12n?1APk(q))+AP2n(q), where AP(q) represents corresponding P-Eulerian polynomial. all conjectured Ln(q) has only real zeros and L4n+1(q) divisible L2n(q). In this paper we obtain simple recurrence relation satisfied affirmatively solve Stanley's conjectures.
منابع مشابه
Counterexamples to the Poset Conjectures of Neggers, Stanley, and Stembridge
We provide the first counterexamples to Neggers’ 1978 conjecture and Stembridge’s 1997 conjecture that the generating functions for descents and peaks in the linear extensions of naturally labeled posets should have all real zeros. We also provide minimum-sized counterexamples to a generalization of the Neggers conjecture due to Stanley that was recently disproved by Brändén.
متن کاملOn Poset Merging∗
We consider the follow poset merging problem: Let X and Y be two subsets of a partially ordered set S. Given complete information about the ordering within both X and Y , how many comparisons are needed to determine the order on X ∪ Y ? This problem is a natural generalization of the list merging problem. While searching in partially ordered sets and sorting partially ordered sets have been con...
متن کاملOn Poset Sandwich Problems
A graph Gs = (V,Es) is a sandwich for a pair of graph Gt = (V,Et) and G = (V,E) if Et ⊆ Es ⊆ E. Any poset, or partially ordered set, admits a unique graph representation which is directed and transitive. In this paper we introduce the notion of sandwich poset problems inspired by former sandwich problems on comparability graphs. In particular, we are interested in seriesparallel and interval po...
متن کاملOn Poset Boolean Algebras
Let 〈P,≤〉 be a partially ordered set. We define the poset Boolean algebra of P , and denote it by F (P ). The set of generators of F (P ) is {xp : p ∈ P}, and the set of relations is {xp ·xq = xp : p ≤ q}. We say that a Boolean algebra B is well-generated, if B has a sublattice G such that G generates B and 〈G,≤G〉 is well-founded. A wellgenerated algebra is superatomic. Theorem 1 Let 〈P,≤〉 be a...
متن کاملOn the Bayesianity of Pereira-stern Tests
C. Pereira and J. Stern have recently introduced a measure of evidence of a precise hypothesis consisting of the posterior probability of the set of points having smaller density than the supremum over the hypothesis. The related procedure is seen to be a Bayes test for specific loss functions. The nature of such loss functions and their relation to stylised inference problems are investigated....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2023
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2023.113359